A Processing Algorithm with some User-Defined Parameters
نویسندگان
چکیده
منابع مشابه
Processing Joins with User-Defined Functions
Most strategies for the computation of relational joins (such as sort-merge or hash-join) are facing major diiculties if the join predicate involves complex, user-deened functions rather than just simple arithmetic comparisons. In this paper, we identify a class of user-deened functions that can be included in a join predicate, such that a join between two sets R and S can still be computed eec...
متن کاملBuilding User-defined Runtime Adaptation Routines for Stream Processing Applications
Stream processing applications are deployed as continuous queries that run from the time of their submission until their cancellation. This deployment mode limits developers who need their applications to perform runtime adaptation, such as algorithmic adjustments, incremental job deployment, and application-specific failure recovery. Currently, developers do runtime adaptation by using externa...
متن کاملProcessing XML View Queries Including User-defined Foreign Functions
With the increased popularity of XML, XML publishing of RDBs has been attracting a lot of research interests. One of typical approaches is to use a middleware system to render XML views over RDBs and to allow users to access data with XML query languages such as XQuery. The query processing is done efficiently by making the best of the querying power of RDBMSs. Namely, XML queries are translate...
متن کاملAdaptive Processing of User-Defined Aggregates in Jaql
Adaptive techniques can dramatically improve performance and simplify tuning for MapReduce jobs. However, their implementation often requires global coordination between map tasks, which breaks a key assumption of MapReduce that mappers run in isolation. We show that it is possible to preserve faulttolerance, scalability, and ease of use of MapReduce by allowing map tasks to utilize a limited s...
متن کاملQueries on Databases With User-Defined Functions
The notion of a database query is generalized for databases with user-defined functions. Then, we can prove that the computable queries coincide with those expressible by an extension of the relational machine, with oracles ([4]). This implies that any complete query language, extended with user-defined function symbols in a "reasonable" way, is still complete. We give an example of a complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control and Automation
سال: 2014
ISSN: 2005-4297
DOI: 10.14257/ijca.2014.7.5.30